Human-like layout algorithms for signalling hypergraphs: outlining requirements

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Architectural Requirements for Autonomous Human-like Agents

TALKING ABOUT MENTAL STATES McCarthy gives reasons why we shall need to describe intelligent robots in mentalistic terms, and why such a robot will need some degree of self consciousness, and he has made suggestions regarding the notation that we and the robot might use to describe its states. This talk extends that work by focusing on the underlying “high level” architectures required to justi...

متن کامل

Electromagnetism-like Algorithms for The Fuzzy Fixed Charge Transportation Problem

In this paper, we consider the fuzzy fixed-charge transportation problem (FFCTP). Both of fixed and transportation cost are fuzzy numbers. Contrary to previous works, Electromagnetism-like Algorithms (EM) is firstly proposed in this research area to solve the problem. Three types of EM; original EM, revised EM, and hybrid EM are firstly employed for the given problem. The latter is being firstl...

متن کامل

Efficient algorithms for dualizing large-scale hypergraphs

A hypergraph F is a set family defined on vertex set V . The dual of F is the set of minimal subsetsH of V such that F∩H 6= ∅ for any F ∈ F . The computation of the dual is equivalent to many problems, such as minimal hitting set enumeration of a subset family, minimal set cover enumeration, and the enumeration of hypergraph transversals. Although many algorithms have been proposed for solving ...

متن کامل

Streaming Algorithms for 2-Coloring Uniform Hypergraphs

We consider the problem of two-coloring n-uniform hypergraphs. It is known that any such hypergraph with at most 1 10 √

متن کامل

Two optimal algorithms for finding bi-directional shortest path design problem in a block layout

In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Briefings in Bioinformatics

سال: 2018

ISSN: 1467-5463,1477-4054

DOI: 10.1093/bib/bby099